Termination w.r.t. Q proof of TRS/higher-order/AotoYam002.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)

Q is empty.

↳ QTRS

  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)

Q is empty.

The TRS is overlay and locally confluent. By [15] we can switch to innermost.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)

The set Q consists of the following terms:

app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(filter, f)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(cons, y), app(app(filter, f), ys))
APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(filter, f), app(app(cons, y), ys)) → APP(filtersub, app(f, y))
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(filter, f)
APP(app(filter, f), app(app(cons, y), ys)) → APP(app(filtersub, app(f, y)), f)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(filter, f), app(app(cons, y), ys)) → APP(f, y)
APP(app(filter, f), app(app(cons, y), ys)) → APP(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))

The TRS R consists of the following rules:

app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)

The set Q consists of the following terms:

app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(filter, f)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(cons, y), app(app(filter, f), ys))
APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(filter, f), app(app(cons, y), ys)) → APP(filtersub, app(f, y))
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(filter, f)
APP(app(filter, f), app(app(cons, y), ys)) → APP(app(filtersub, app(f, y)), f)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(filter, f), app(app(cons, y), ys)) → APP(f, y)
APP(app(filter, f), app(app(cons, y), ys)) → APP(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))

The TRS R consists of the following rules:

app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)

The set Q consists of the following terms:

app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(cons, y), app(app(filter, f), ys))
APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(filter, f)
APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(filter, f), app(app(cons, y), ys)) → APP(filtersub, app(f, y))
APP(app(filter, f), app(app(cons, y), ys)) → APP(app(filtersub, app(f, y)), f)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(filter, f)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(filter, f), app(app(cons, y), ys)) → APP(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
APP(app(filter, f), app(app(cons, y), ys)) → APP(f, y)

The TRS R consists of the following rules:

app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)

The set Q consists of the following terms:

app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 6 less nodes.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ QDP

                  ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(filter, f), app(app(cons, y), ys)) → APP(f, y)

The TRS R consists of the following rules:

app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)

The set Q consists of the following terms:

app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(filter, f), app(app(cons, y), ys)) → APP(f, y)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
APP(x1, x2) = APP(x2)
app(x1, x2) = app(x1, x2)
filtersub = filtersub
false = false
cons = cons
filter = filter
true = true

Lexicographic path order with status [19].
Quasi-Precedence:

false > [APP₁, filtersub, cons] > app₂
filter > [APP₁, filtersub, cons] > app₂
true > [APP₁, filtersub, cons] > app₂

Status:

true: multiset
filter: multiset
APP₁: [1]
false: multiset
filtersub: multiset
app₂: [2,1]
cons: multiset

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ QDP

                  ↳ QDPOrderProof

                    ↳ QDP

                      ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)

The set Q consists of the following terms:

app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.